\relaxing" | a Symbolic Sparse Matrix Method Exploiting the Model Structure in Generating Eecient Simulation Code
نویسندگان
چکیده
This paper presents a new method for symbolically solving large sets of algebraically coupled equations as they are frequently encountered in the formulation of mathematical models of physical systems in object{ oriented modeling. The method, called \relaxing," enables the modeler to exploit the special matrix structure of the type of system under study by simply placing the keyword relax at appropriate places in the model class libraries. This procedure deenes an evaluation sequence for a sparse matrix Gaussian elimination scheme. The method is demonstrated at hand of several broad classes of physical systems: drive trains, electrical circuits, and tree{structured multibody systems. In particular, relaxing allows a model compiler, such as Dymola, to start from a declarative, object{ oriented description of the model, and to automatically derive the recursive O(f) algorithm used in modern multibody programs.
منابع مشابه
The Permutation Algorithm for Non-Sparse Matrix Determinant in Symbolic Computation
This paper considers the symbolic determinant computation. The aptness of permutation method for symbolic determinant is justified and a new efficient algorithm is proposed to implement the permutation method. Exploiting the fact computers perform arithmetic operations fast, the proposed algorithm generate all the permutations without manipulation on additional 2nd array or redundancies found i...
متن کاملEecient Derivation of Exact S-expanded Symbolic Expressions for Behavioral Modeling of Analog Circuits
|This paper presents an eecient method for deriving exact s-expanded symbolic expressions for behavioral modeling of analog circuits. The key idea is to introduce a graph-based representation called multi-root Determinant Decision Diagram (DDD), where each root represents the symbolic coeecient of a particular power of s. By exploiting sharing and sparsity, a huge number of symbolic product ter...
متن کاملRun-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures
Automatic scheduling for directed acyclic graphs (DAG) and its applications for coarse-grained irregular problems such as large n-body simulation have been studied in the literature. However solving irregular problems with mixed granularities such as sparse matrix factorization is challenging since it requires eecient run-time support to execute a DAG schedule. In this paper, we investigate run...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملVoice-based Age and Gender Recognition using Training Generative Sparse Model
Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996